preorder traversal造句

• In this paper , a lot of researches and exploration are applied to studying the universality and expansibility of hardware and the arithmetic design and code optimization of software . especially , all of the following arithmetics or conceptions are worked out in the research of software design : self - adaptable compression arithmetic based on dictionary model for data collection system , similarity full binary sort tree , a optimized quick search arithmetic and an improved arithmetic of multiplication in the floating - point operation . and all of the arithmetic are designed with mcs - 51 assembly language . the quick search arithmetic , in which merits of both binary search and sequence search are used fully , are based on the specialty of preorder traversal in similarity full binary sort tree
  特别在软件设计研究中，提出了适用于数据采集系统的数据压缩算法? ?基于字典模型的自适应压缩算法；提出了类满二叉排序树的定义；提出了基于类满二叉排序树的先序遍历特性的最优化快速查找算法，它充分利用了折半查找和顺序查找各自的优点；提出了浮点运算乘法的改进算法；并在mcs - 51汇编语言层次上对所有的算法加以实现。